Enumeration of irreducible binary words

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over Fq of length q n defined by polynomials of degree r where q is a prime power and n, r are arbitrary positive integers. We obtain an upper bound on the number of such codes.

متن کامل

Enumeration of certain binary vectors

In 1986, W. S. Griffith [2] proposed reliability model and described a Markov chain approach for computing the reliability in the system. F. K. Hwang and S. Papastavridis gave a closed-form formula for this reliability in 1991, by counting the number of n-dimensional binary vectors containing exactly k non-overlapping m-tuples of consecutive ones. In 1988, T. M. Apostol [1] established recursiv...

متن کامل

Table of Low-Weight Binary Irreducible Polynomials

finite fields, irreducible polynomials A table of low-weight irreducible polynomials over the finite field F2 is presented. For each integer n in the range 2 = n = 10,000, a binary irreducible polynomial f(x) of degree n and minimum posible weight is listed. Among those of minimum weight, the polynomial listed is such that the degree of f(x) – xn is lowest (similarly, subsequent lower degrees a...

متن کامل

Efficient enumeration of words in regular languages

The cross-section enumeration problem is to list all words of length n in a regular language L in lexicographical order. The enumeration problem is to list the rst m words in L according to radix order. We present an algorithm for the crosssection enumeration problem that is linear in n + t, where t is the output size. We provide a detailed analysis of the asymptotic running time of our algorit...

متن کامل

Enumeration and structure of trapezoidal words

Trapezoidal words are words having at most n+1 distinct factors of length n for every n ≥ 0. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1988

ISSN: 0166-218X

DOI: 10.1016/0166-218x(88)90078-9